融合初值校准与二阶逼近的单星测频定位算法

为减小单星测频定位的误差,提出一种融合初值校准与二阶逼近的单星测频定位算法。该算法在卫星接收信号多普勒频移为零的时间点,通过测距获得卫星到定位目标的距离信息,利用距离信息修正轨道平面与定位目标的几何关系,为初值的选取提供校准手段;将校准的初值代入含二阶级数的定位方程泰勒展开式,通过较少次数的迭代得到定位目标的真实位置,从而降低定位的算法复杂度,提高定位精度。仿真结果表明,所提出的算法与多普勒单星定位算法相比,迭代次数和定位误差大幅度减小,其实现简单、计算量少、误差小,在单星定位研究领域具有较高的理论价值和实用价值。     

弹性轨道磁悬浮控制系统模型降阶研究

在磁悬浮控制系统中,常常忽略轨道的弹性来设计控制算法。在这种控制算法作用下,当轨道刚度较小时,系统容易产生振动。为解决该问题,可以将轨道弹性加入悬浮模型,然后设计控制算法。考虑轨道弹性之后,悬浮系统的模型会比较复杂,控制算法难以在工程实现。为此,采用Hankel范数近似法对考虑轨道弹性后的模型进行降阶,并且在降阶模型的基础上设计控制算法,解决了轨道弹性引发的系统振动问题。并且,这种方法容易在工程中实现。文章最后利用仿真结果验证了降阶方法的可行性。     

Optimizing natural gas pipeline transmission with nonuniform elevation: A new initialization approach

In this paper, we develop an iterative piecewise linear approximation approach with a novel initialization method to solve natural gas pipeline transmission problems with the nonuniform network elevation. Previous approaches, such as energy minimization methods, cannot be applied to solve problems with the nonuniform network elevation because they exclude pressure range constraints, and thus provide solutions far from optimum. We propose a new initialization model that considers pressure range constraints and improves the optimality of the solutions and the computational efficiency. Furthermore, we extend the energy minimization methods and provide the necessary conditions under which the extended methods operate in networks with the nonuniform elevation. We test the performances of the methods with previously reported pipeline networks from the literature, with the open data set GasLib, and with our industrial collaborator. The initialization approach is shown to be more efficient than the method with fixed initial breakpoints. The newly proposed initialization approach generates solutions with a higher accuracy than the extended energy minimization methods, especially in large‐size networks. The proposed method has been applied to natural gas transmission planning by the China National Petroleum Corporation and has brought a direct profit increase of 330 million U.S. dollars in 2015‐2017.     

Approximation algorithms for general one‐warehouse multi‐retailer systems

Logistical planning problems are complicated in practice because planners have to deal with the challenges of demand planning and supply replenishment, while taking into account the issues of (i) inventory perishability and storage charges, (ii) management of backlog and/or lost sales, and (iii) cost saving opportunities due to economies of scale in order replenishment and transportation. It is therefore not surprising that many logistical planning problems are computationally difficult, and finding a good solution to these problems necessitates the development of many ad hoc algorithmic procedures to address various features of the planning problems. In this article, we identify simple conditions and structural properties associated with these logistical planning problems in which the warehouse is managed as a cross‐docking facility. Despite the nonlinear cost structures in the problems, we show that a solution that is within ε‐optimality can be obtained by solving a related piece‐wise linear concave cost multi‐commodity network flow problem. An immediate consequence of this result is that certain classes of logistical planning problems can be approximated by a factor of (1 + ε) in polynomial time. This significantly improves upon the results found in literature for these classes of problems. We also show that the piece‐wise linear concave cost network flow problem can be approximated to within a logarithmic factor via a large scale linear programming relaxation. We use polymatroidal constraints to capture the piece‐wise concavity feature of the cost functions. This gives rise to a unified and generic LP‐based approach for a large class of complicated logistical planning problems. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

基于时频图像三维熵特征的雷达信号识别

针对雷达信号识别算法存在着准确率低以及抗噪性差的问题,提出基于时频图像三维熵特征的雷达信号识别算法。该方法对雷达信号时频变换后得到的时频灰度图提取其香农熵(Sh En)、奇异谱熵(Ss En)和范数熵(No En),并将三维熵值作为信号识别的特征向量,采用支持向量机实现信号的分类识别。仿真实验表明,提出的算法能够在低信噪比下得到较高的正确识别率。     

Revenue management under randomly evolving economic conditions

We consider a dynamic pricing model in which the instantaneous rate of the demand arrival process is dependent on not only the current price charged by the concerned firm, but also the present state of the world. While reflecting the current economic condition, the state evolves in a Markovian fashion. This model represents the real‐life situation in which the sales season is relatively long compared to the fast pace at which the outside environment changes. We establish the value of being better informed on the state of the world. When reasonable monotonicity conditions are met, we show that better present economic conditions will lead to higher prices. Our computational study is partially calibrated with real data. It demonstrates that the benefit of heeding varying economic conditions is on par with the value of embracing randomness in the demand process. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 66:73–89,2019     

基于Hankel范数近似的磁悬浮控制系统模型降阶

对于磁悬浮系统而言,忽略轨道的弹性进行控制算法设计,是一种常见的方法。但是,当轨道的刚度较小时,这种方法的控制性能较差。考虑轨道弹性所设计的控制算法,理论上能确保系统的良好性能但是会使得系统复杂度增加。本文采用Hankel范数近似法对基于弹性轨道的模型进行降阶。针对刚性轨道系统模型和降阶模型设计控制算法,利用仿真结果验证降阶模型的可行性。     

关于Reich的公开问题

设E是具有一致G -可微范数的实Banach空间 ,D是E的非空闭凸子集 ,T :D→D是非扩张映象 ,F(T)非空。设 {αn} ,{ βn}是 [0 ,1]中满足一定条件的两个序列 ,定义压缩映象St:D→D为 :St(z) =(1-t)x tTz , x ,z∈D , n≥ 1,t∈ (0 ,1) .设zt 是St 的唯一不动点 ,若当t→ 1-时 ,{zt}强收敛于某点z∈F(T) .那么 ,Reich序列 {xn}强收敛于某点z∈F(T) .